Reaching approximate Byzantine consensus with multi-hop communication
نویسندگان
چکیده
منابع مشابه
Reaching Approximate Byzantine Consensus with Multi-hop Communication
We address the problem of reaching consensus in the presence of Byzantine faults. Fault-tolerant consensus algorithms typically assume knowledge of nonlocal information and multi-hop communication; however, this assumption is not suitable for large-scale static/dynamic networks. A handful of iterative algorithms have been proposed recently under the assumption that each node (faulty or fault-fr...
متن کاملReaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
We consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving ability, the topology is dynamic. The number of Byzantine nodes is bounded by f and known by all correct nodes. We first introduce an approximate Byzantine co...
متن کاملParameter-independent Iterative Approximate Byzantine Consensus
In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults, f . This research is supported in part by National Science Foundation award CNS 1059540 and Army Research Office grant W-911-NF-0710287. Any opinions, findings, and conclusions or recommendations expresse...
متن کاملBrief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks
We consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving ability, the topology is dynamic. The number of Byzantine nodes is bounded by f and known by all correct nodes. We first introduce an approximate Byzantine co...
متن کاملIterative Approximate Byzantine Consensus under a Generalized Fault Model
In this work, we consider a generalized fault model that can be used to represent awide range of failure scenarios, including correlated failures and non-uniform node reliabilities. This fault model is general in the sense that fault models studied in prior relatedwork, such as f -total and f -local models, are special cases of the generalized fault model. Under the generalized fault model, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2017
ISSN: 0890-5401
DOI: 10.1016/j.ic.2016.12.003